منابع مشابه
An integral generalization of the Gusein-Zade–Natanzon theorem
One of the useful methods of the singularity theory, the method of real morsifications [AC0, GZ] (see also [AGV]) reduces the study of discrete topological invariants of a critical point of a holomorphic function in two variables to the study of some real plane curves immersed into a disk with only simple double points of self-intersection. For the closed real immersed plane curves V.I.Arnold [...
متن کاملFrom Directed Path to Linear Order - The Best Choice Problem for Powers of Directed Path
We examine the evolution of the best choice algorithm and the probability of its success from a directed path to the linear order of the same cardinality through kth powers of a directed path, 1 ≤ k < n. The vertices of a kth power of a directed path of a known length n are exposed one by one to a selector in some random order. At any time the selector can see the graph induced by the vertices ...
متن کاملA hybrid algorithm for the path center problem
Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...
متن کاملSite-directed protein recombination as a shortest-path problem.
Protein function can be tuned using laboratory evolution, in which one rapidly searches through a library of proteins for the properties of interest. In site-directed recombination, n crossovers are chosen in an alignment of p parents to define a set of p(n + 1) peptide fragments. These fragments are then assembled combinatorially to create a library of p(n+1) proteins. We have developed a comp...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2010
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2009.08.001